Scatter search for an uncapacitated p-hub median problem
نویسندگان
چکیده
منابع مشابه
Scatter search for an uncapacitated p-hub median problem
Scatter search is a population-based method that has been shown to yield high-quality outcomes for combinatorial optimization problems. It uses strategies for combining solution vectors that have proved effective in a variety of problem settings. In this paper, we present a scatter search implementation for an NP-hard variant of the classic p-hub median problem. Specifically, we tackle the unca...
متن کاملGRASP for the Uncapacitated -Allocation -hub Median Problem
In this paper we propose several heuristics for the Uncapacitated -Allocation -Hub Median Problem. In the classical -hub problem, given a set of nodes with pairwise traffic demands, we must select of them as hub locations and route all traffics through them at a minimum cost. We target here an extension, called the -allocation -hub median problem, recently proposed by Yaman (2011), in which eve...
متن کاملParallelization of the scatter search for the p-median problem
This article develops several strategies for the parallelization of the metaheuristic called scatter search, which is a population-based method that constructs solutions by combining others. Three types of parallelization have been proposed to achieve either an increase of efficiency or an increase of exploration. The procedures have been coded in C using OpenMP and compared in a shared memory ...
متن کاملThe Uncapacitated Single Allocation p-Hub Median Problem with Stepwise Cost Function
In this paper, we address a new version of the Uncapacitated Single Allocation p-Hub Median Problem (USApHMP) in which transportation costs on each edge are given by piecewise constant cost functions. In the classical USApHMP, transportation costs are modelled as linear functions of the transport volume, where a fixed discount factor on hubhub connections is introduced to simulate economies of ...
متن کاملSolving the Uncapacitated Single Allocation p-Hub Median Problem on GPU
A parallel genetic algorithm (GA) implemented on GPU clusters is proposed to solve the Uncapacitated Single Allocation p-Hub Median problem. The GA uses binary and integer encoding and genetic operators adapted to this problem. Our GA is improved by generated initial solution with hubs located at middle nodes. The obtained experimental results are compared with the best known solutions on all b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2015
ISSN: 0305-0548
DOI: 10.1016/j.cor.2014.12.009